Probabilistic Model Counting with Short XORs

The idea of counting the number of satisfying truth assignments (models) of a formula by adding random parity constraints can be traced back to the seminal work of Valiant and Vazirani, showing that NP is as easy as detecting unique solutions. While theoretically sound, the random parity constraints in that construction have the following drawback: each constraint, on average, involves half of all variables. As a result, the branching factor associated with searching for models that also satisfy the parity constraints quickly gets out of hand. In this work we prove that one can work with much shorter parity constraints and still get rigorous mathematical guarantees, especially when the number of models is large so that many constraints need to be added. Our work is based on the realization that the essential feature for random systems of parity constraints to be useful in probabilistic model counting is that the geometry of their set of solutions resembles an error-correcting code.Comment: To appear in SAT 1

The curatorial consequences of being moved, moveable or portable: the case of carved stones

It matters whether a carved stone is moved, moveable or portable. This influences perceptions of significance and of form and nature – is it a monument or an artefact? This duality may in turn affect understanding and appreciation of the resource. It has implications for how and if carved stones can be legally protected, who owns them, where and how they are administered, and by whom. The complexities of the legislation mean that all too often this is also a grey area. This paper explores these curatorial issues and their impact

Parameterized Compilation Lower Bounds for Restricted CNF-formulas

We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that encode CNF-formulas restricted by several graph width measures. In particular, we show that - there are CNF formulas of size $n$ and modular incidence treewidth $k$ whose smallest DNNF-encoding has size $n^{\Omega(k)}$, and - there are CNF formulas of size $n$ and incidence neighborhood diversity $k$ whose smallest DNNF-encoding has size $n^{\Omega(\sqrt{k})}$. These results complement recent upper bounds for compiling CNF into DNNF and strengthen---quantitatively and qualitatively---known conditional low\-er bounds for cliquewidth. Moreover, they show that, unlike for many graph problems, the parameters considered here behave significantly differently from treewidth

Using Open Source Libraries in the Development of Control Systems Based on Machine Vision

The possibility of the boundaries detection in the images of crushed ore particles using a convolutional neural network is analyzed. The structure of the neural network is given. The construction of training and test datasets of ore particle images is described. Various modifications of the underlying neural network have been investigated. Experimental results are presented. © 2020, IFIP International Federation for Information Processing.Foundation for Assistance to Small Innovative Enterprises in Science and Technology, FASIEFunding. The work was performed under state contract 3170ΓC1/48564, grant from the FASIE

Bit-Vector Model Counting using Statistical Estimation

Approximate model counting for bit-vector SMT formulas (generalizing \#SAT) has many applications such as probabilistic inference and quantitative information-flow security, but it is computationally difficult. Adding random parity constraints (XOR streamlining) and then checking satisfiability is an effective approximation technique, but it requires a prior hypothesis about the model count to produce useful results. We propose an approach inspired by statistical estimation to continually refine a probabilistic estimate of the model count for a formula, so that each XOR-streamlined query yields as much information as possible. We implement this approach, with an approximate probability model, as a wrapper around an off-the-shelf SMT solver or SAT solver. Experimental results show that the implementation is faster than the most similar previous approaches which used simpler refinement strategies. The technique also lets us model count formulas over floating-point constraints, which we demonstrate with an application to a vulnerability in differential privacy mechanisms

Timescales of IP(3)-evoked Ca(2+) spikes emerge from Ca(2+) puffs only at the cellular level

The behavior of biological systems is determined by the properties of their component molecules, but the interactions are usually too complex to understand fully how molecular behavior generates cellular behavior. Ca(2+) signaling by inositol trisphosphate receptors (IP(3)R) offers an opportunity to understand this relationship because the cellular behavior is defined largely by Ca(2+)-mediated interactions between IP(3)R. Ca(2+) released by a cluster of IP(3)R (giving a local Ca(2+) puff) diffuses and ignites the behavior of neighboring clusters (to give repetitive global Ca(2+) spikes). We use total internal reflection fluorescence microscopy of two mammalian cell lines to define the temporal relationships between Ca(2+) puffs (interpuff intervals, IPI) and Ca(2+) spikes (interspike intervals) evoked by flash photolysis of caged IP(3). We find that IPI are much shorter than interspike intervals, that puff activity is stochastic with a recovery time that is much shorter than the refractory period of the cell, and that IPI are not periodic. We conclude that Ca(2+) spikes do not arise from oscillatory dynamics of IP(3)R clusters, but that repetitive Ca(2+) spiking with its longer timescales is an emergent property of the dynamics of the whole cluster array

Perforated Meckel diverticulum

Perforation of a Meckel diverticulum (MD) is a rare complication that can often mimic appendicitis. This case report identifies a child who presented to our Emergency Department (ED) with right lower quadrant abdominal pain, free fluid and air in the abdomen and pelvis, and inflammatory changes visualized on Ultrasonography (US) and computer tomography (CT) scan. In our patient, ruptured appendicitis was suspected, and the diagnosis of ruptured MD was ultimately made by laparoscopy. This case demonstrates that a healthy degree of suspicion for complicated MD should be present when dealing with a questionable diagnosis of appendicitis, particularly in the pediatric population

A Bayesian approach to modelling heterogeneous calcium responses in cell populations

Calcium responses have been observed as spikes of the whole-cell calcium concentration in numerous cell types and are essential for translating extracellular stimuli into cellular responses. While there are several suggestions for how this encoding is achieved, we still lack a comprehensive theory. To achieve this goal it is necessary to reliably predict the temporal evolution of calcium spike sequences for a given stimulus. Here, we propose a modelling framework that allows us to quantitatively describe the timing of calcium spikes. Using a Bayesian approach, we show that Gaussian processes model calcium spike rates with high fidelity and perform better than standard tools such as peri-stimulus time histograms and kernel smoothing. We employ our modelling concept to analyse calcium spike sequences from dynamically-stimulated HEK293T cells. Under these conditions, different cells often experience diverse stimuli time courses, which is a situation likely to occur in vivo. This single cell variability and the concomitant small number of calcium spikes per cell pose a significant modelling challenge, but we demonstrate that Gaussian processes can successfully describe calcium spike rates in these circumstances. Our results therefore pave the way towards a statistical description of heterogeneous calcium oscillations in a dynamic environmen

Improving MCS Enumeration via Caching

Enumeration of minimal correction sets (MCSes) of conjunctive normal form formulas is a central and highly intractable problem in infeasibility analysis of constraint systems. Often complete enumeration of MCSes is impossible due to both high computational cost and worst-case exponential number of MCSes. In such cases partial enumeration is sought for, finding applications in various domains, including axiom pinpointing in description logics among others. In this work we propose caching as a means of further improving the practical efficiency of current MCS enumeration approaches, and show the potential of caching via an empirical evaluation.Peer reviewe